Перевод: с английского на русский

с русского на английский

augmented problem

См. также в других словарях:

  • Augmented Reality — Die Artikel Augmented Reality, Mixed Reality und Virtual Reality überschneiden sich thematisch. Hilf mit, die Artikel besser voneinander abzugrenzen oder zu vereinigen. Beteilige dich dazu an der Diskussion über diese Überschneidungen. Bitte… …   Deutsch Wikipedia

  • Augmented reality — Die Artikel Augmented Reality, Mixed Reality und Virtual Reality überschneiden sich thematisch. Hilf mit, die Artikel besser voneinander abzugrenzen oder zu vereinigen. Beteilige dich dazu an der Diskussion über diese Überschneidungen. Bitte… …   Deutsch Wikipedia

  • Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… …   Wikipedia

  • Fleet problem — was the term by the U.S. Navy to describe each of twenty one large scale naval exercises conducted between 1923 and 1940. They are labeled with roman numerals, from Fleet Problem I through Fleet Problem XXI. A twenty second Fleet Problem exercise …   Wikipedia

  • Air-augmented rocket — Air augmented rockets (also known as rocket ejector, ramrocket, ducted rocket, integral rocket/ramjets, or ejector ramjets) use the supersonic exhaust of some kind of rocket engine to further compress air collected by ram effect during flight to… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… …   Wikipedia

  • Maximum coverage problem — The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number k. The sets may have …   Wikipedia

  • Simplex algorithm — In mathematical optimization theory, the simplex algorithm, created by the American mathematician George Dantzig in 1947, is a popular algorithm for numerical solution of the linear programming problem. The journal Computing in Science and… …   Wikipedia

  • Erweiterte Realität — Augmented Reality Beispiel „Wikitude AR Travel Guide“ auf einem G1 Google Smartphone (Android) Unter erweiterter Realität (auch engl. Augmented reality [ɔːɡˈmɛntɪd ɹiˈælɪti], kurz: AR [eɪˈɑː]) versteht man die computergestützte Erweiteru …   Deutsch Wikipedia

  • Fractional cascading — In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»